Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding
نویسندگان
چکیده
منابع مشابه
Exact algorithms for minimum routing cost trees
Given a set of points and distances between them, a basic problem in network design calls for selecting a graph connecting them at a minimum total routing cost, that is, the sum over all pairs of points of the length of their shortest path in the graph. In this paper, we describe some branch-and-bound algorithms for the exact solution of a relevant special case arising when the graph has to be ...
متن کاملParallelized approximation algorithms for minimum routing cost spanning trees
Let G = (V,E) be an undirected graph with a nonnegative edgeweight function w. The routing cost of a spanning tree T of G is ∑ u,v∈V dT (u, v), where dT (u, v) denotes the weight of the simple u-v path in T. The Minimum Routing Cost Spanning Tree (MRCT) problem [WLB+00] asks for a spanning tree of G with the minimum routing cost. In this paper, we parallelize several previously proposed approxi...
متن کاملDiversity coding-based survivable routing with QoS and differential delay bounds
Survivable routing with instantaneous recovery gained much attention in the last decade, as in optical backbone networks even the shortest disruption of a connection may cause tremendous loss of data. Recently, strict delay requirements emerges with the growing volume of multimedia and video streaming applications, which have to be ensured both before and after a failure. Diversity coding provi...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملFast Approximation Algorithms for the Generalized Survivable Network Design Problem
In a standard f -connectivity network design problem, we are given an undirected graph G = (V,E), a cut-requirement function f : 2 → N, and non-negative costs c(e) for all e ∈ E. We are then asked to find a minimum-cost vector x ∈ N such that x(δ(S)) ≥ f(S) for all S ⊆ V . We focus on the class of such problems where f is a proper function. This encodes many well-studied NP-hard problems such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2020
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2019.2963574